A hierarchy of cyclic languages
نویسندگان
چکیده
منابع مشابه
Cyclic Languages and Strongly Cyclic Languages
We prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages.
متن کاملA Hierarchy of Implementable MSC Languages
We develop a unifying theory of message-passing automata (MPAs) and MSC languages. We study several variants of regular as well as product MSC languages, their closure under finite union and their intersection. Furthermore, we analyse the expressive power of several variants of MPAs and characterize the language classes of interest by the corresponding classes of MPAs.
متن کاملTowards a Hierarchy of Visual Languages
Formalisms for visual language specification have been investigated for more than two decades now. However, there has been little attempt to develop a systematic and comprehensive hierarchy of visual languages based on formal properties. Given the importance of the Chomsky hierarchy in the theory of textual languages and the difficulty of comparing the different visual language formalisms, it i...
متن کاملOn the hierarchy of Petri net languages
— We prove Jtn {D[*) £ M (£>!*), where I>î* is the one-sided Dyck language, and discuss some old and new resuits concerning Pétri net languages. The above resuit shows that Pétri nets without X-labeled transitions are less powerful thon gênerai nets as regards their firing séquences since the class S£\ of gênerai Pétri net languages {Hack [13]) is identical with Aî^D'?), and the class ^Sf^ of c...
متن کاملThe Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Bojańczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new class can be seen as a different way of generalizing the notion of regularity from finite to infinite words. This paper compares regular and max-regular languages in terms of topological complexity. It is proved that up to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1997
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1997310403551